An Improved Approach to Minimize Context Switching in round Robin Scheduling Algorithm Using Optimization Techniques

Scheduling is a fundamental operating system function. Almost all computer resources are scheduled before use. All major CPU scheduling algorithms concentrates more on to maximize CPU utilization, throughput, waiting time and turnaround time. In particularly, the performance of round robin algorithm depends heavily on the size of the time quantum. To improve the performance of CPU and to minimize the overhead on the CPU, time quantum should be large with respect to the context switch time. Otherwise, context switching will be more. In this research paper, we propose a method to minimize the context switching and to break the fixed time quantum size in round robin scheduling algorithm using optimization techniques. Both results and calculations show that, our proposed method is more efficient than the existing round robin scheduling algorithm. KeywordsTime quantum, CPU Scheduling, Context Switching, Round Robin (RR), Simplex Method, LPP -----------------------------------------------------------------------***---------------------------------------------------------------------